منابع مشابه
COMBINATORICS OF THE z THEOREM
The analytic proof of Theorem 1 in [4] uses a special evaluation of a generalized hypergeometric series. Because of the extensive work on the combinatorics of these series, one might think that a combinatorial proof of Theorem 1 is routine. However, this is not true. There are two bijective models for such series. The first allows arbitrary parameters in the series and computes generating funct...
متن کاملThe Order Steps of an Analytic Combinatorics
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
متن کاملAutomatic Theorem-Proving in Combinatorics on Words
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence. Dedicated to the memory of Sheng Yu (1950–2012): friend and colleague
متن کاملEuler’s partition theorem and the combinatorics of `-sequences
Euler’s partition theorem states that the number of partitions of an integer N into odd parts is equal to the number of partitions of N in which the ratio of successive parts is greater than 1. It was shown by Bousquet-Mélou and Eriksson in [9] that a similar result holds when “odd parts” is replaced by “parts that are sums of successive terms of an `-sequence” and the ratio “1” is replaced by ...
متن کاملEuler's partition theorem and the combinatorics of l-sequences
Euler’s partition theorem says that the number of ways to partition an integer into odd parts is the same as the number of ways to partition it into distinct parts. We show how the combinatorics of “l-sequences” gives rise not only to a generalization of Euler’s theorem (discovered by Bousquet-Melou and Eriksson in 1997), but also to a generalization of Sylvester’s bijective proof. This is join...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90224-6